منابع مشابه
The Quickest Transshipment Problem
A dynamic network consists of a graph with capacities and transit times on its edges. The quickest transshipment problem is defined by a dynamic network with several sources and sinks; each source has a specified supply and each sink has a specified demand. The problem is to send exactly the right amount of flow out of each source and into each sink in the minimum overall time. Variations of th...
متن کاملFaster Algorithms for the Quickest Transshipment Problem
A transshipment problem with demands that exceed network capacity can be solved by sending ow in several waves. How can this be done in the minimum number of waves? This is the question tackled in the quickest transshipment problem. Hoppe and Tardos 10] describe the only known polynomial time algorithm to solve this problem. Their algorithm repeatedly minimizes submodular functions using the el...
متن کاملThe multilocation transshipment problem
We consider a supply chain, which consists of several retailers and one supplier. The retailers, who possibly differ in their cost and demand parameters, may be coordinated through replenishment strategies and transshipments, that is, movement of a product among the locations at the same echelon level. We prove that in order to minimize the expected long-run average cost for this system, an opt...
متن کاملThe Dynamic Transshipment Problem
We investigate the strategy of transshipments in a dynamic deterministic demand environment over a finite planning horizon. This is the first time that transshipments are examined in a dynamic or deterministic setting. We consider a system of two locations which replenish their stock from a single supplier, and where transshipments between the locations are possible. Our model includes fixed (p...
متن کاملThe Capacitated Transshipment Location Problem under Uncertainty
We consider the stochastic capacitated transshipment problem for freight transportation where an optimal location of the transshipment facilities, which minimizes the total cost, must be found. The total cost is given by the sum of the total fixed cost plus the expected minimum total flow cost, when the throughput costs of the facilities are random variables with unknown probability distributio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2000
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.25.1.36.15211